Universality of Reversible Hexagonal Cellular Automata
نویسندگان
چکیده
We define a hexagonal partitioned cellular automaton (HPCA), and study logical universality of a reversible HPCA. We give a specific 64-state reversible HPCA H1, and show that a Fredkin gate can be embedded in this cellular space. Since a Fredkin gate is known to be a universal logic element, logical universality of H1 is concluded. Although the number of states of H1 is greater than those of the previous models of reversible CAs having universality, the size of the configuration realizing a Fredkin gate is greatly reduced, and its local transition function is still simple. Comparison with the previous models, and open problems related to these model are also discussed.
منابع مشابه
Computation and Construction Universality of Reversible Cellular Automata
An arbitrary d-dimensional cellular automaton can be constructively embedded in a reversible one having d + 1 dimensions. In particular, there exist computationand construction-universal reversible cellular automata. Thus, we explicitly show a way of implementing nontrivial irreversible processes in a reversible medium. Finally, we derive new results for the bounding problem for configurations,...
متن کاملUniversality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)
متن کامل
Reversible computing and cellular automata — a survey ∗ ( Preliminary draft )
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. In this survey/tutorial paper, we discuss how computation can be carried out in a reversible system, how a universal reversible computer can be constructed by reversible logic elements, and how such logic elements are ...
متن کاملUniversality of One-Dimensional Reversible and Number-Conserving Cellular Automata
We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, Garcı́aRamos proved that every RNCCA shows trivial behavior in the sense that all the signals in the RNCCA do not interact each other. However, if we increase the neighborhood size, we can find many complex RNCCAs...
متن کاملIntrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the deenitions of ca and of the Block (bca) and Partitioned (pca) subclasses. We note that pca simulate ca. A simulation of reversible ca (r-ca) with reversible pca is built contradicting the intuition of known undecidability results. We build a 1-r-ca which is intrinsic universal, i.e., able ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 33 شماره
صفحات -
تاریخ انتشار 1999